Selecting two different defective coins q

نویسندگان

  • Mingnan Qi
  • Sanyang Liu
چکیده

In this paper, given a balance scale and the information that there are exactly two different defective coins present, the authors consider the problem of ascertaining the minimum number of testing which suffice to determine the two different defective coins in a set of k coins in same appearance, and here k P 3. A testing algorithm for all the possible values of k is constructed, and the testing algorithm needs at most one testing step more than the optimal testing algorithm. 2006 Published by Elsevier Inc.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of the Present Value of Ancient Coins

Many of the pious bequest policies (Vaghf) !supportFootnotes]-->[1] at present time are denominated by old or ancient coins, the present value of which is not well known. Therefore, fixing the annual custodian fee for Vaghf is quite difficult. Moreover, the difficulty of evaluation of the present value of the dowry the husband has to pay to the bride after the marriage (Mahr) !supportFootno...

متن کامل

Fountains, histograms, and q-identities

Merlini and Sprugnoli [6] discuss fountains and histograms; for the reader’s convenience, we review a few key issues here. A fountain with n coins is an arrangement of n coins in rows such that each coin in a higher row touches exactly two coins in the next lower row. A p-histogram is a sequence of columns in which the height of the ( j +1)st column is at most k + p, if k is the height of colum...

متن کامل

The Logic in Computer Science Collumn

ion can overcome the deficit of the power of modern computers and solve the metaprogram problem: let’s consider amounts of coins instead of coin numbers. This idea is natural: when somebody is solving puzzles he/she operates in terms of amounts of coins of different kinds not in terms of their numbers! Let us present this hint in formal terms as an abstract model game(N,M) (N ≥ 1, M ≥ 0). Posit...

متن کامل

A Quantum Analogue of Parrondo's Game

We consider the discrete-time quantum walk in the plane, and present a quantum implementation of Parrondo's game for four players. Physical significance of the game strategies are also discussed. The theory of games studies models in which several parties try to maximize their gains by selecting different strategies that are allowed by the rules of a particular game [5]. It has found to have re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006